一类具有资源约束和优先加工顺序约束极小化加权总完工时间调度优化问题研究

本文针对工件间具有链状优先约束和relocation资源约束的极小化加权总完工时间调度优化问题展开研究.针对这一NP难问题,利用relocation约束的性质和贪婪算法的思想,设计了一个多项式近似算法,并证明了当链不可中断,每个链具有相同工件数和工件间具有相同加工时间时,2为该算法的紧界.     

Switchings, extensions, and reductions in central digraphs

A directed graph is called central if its adjacency matrix A satisfies the equation A²=J, where J is the matrix with a 1 in each entry. It has been conjectured that every central directed graph can be obtained from a standard example by a sequence of simple operations called switchings, and also that it can be obtained from a smaller one by an extension. We disprove these conjectures and present a general extension result which, in particular, shows that each counterexample extends to an infinite family.     

Minimizing the total completion time in a single-machine scheduling problem with a learning effect

This paper introduces a new time-dependent learning effect model into a single-machine scheduling problem. The time-dependent learning effect means that the processing time of a job is assumed to be a function of total normal processing time of jobs scheduled in front of it. In most related studies, the actual job processing time is assumed to be a function of its scheduled position when the learning effect is considered in the scheduling problem. In this paper, the actual processing time of a job is assumed to be proportionate to the length and position of the already scheduled jobs. It shows that the addressed problem remains polynomially solvable for the objectives, i.e., minimization of the total completion time and minimization of the total weighted completion time. It also shows that the shortest processing time (SPT) rule provides the optimum sequence for the addressed problem.     

Numerical analysis of an energy-like minimization method to solve the Cauchy problem with noisy data

This paper is concerned with solving the Cauchy problem for an elliptic equation by minimizing an energy-like error functional and by taking into account noisy Cauchy data. After giving some fundamental results, numerical convergence analysis of the energy-like minimization method is carried out and leads to adapted stopping criteria for the minimization process depending on the noise rate. Numerical examples involving smooth and singular data are presented.     

有向网络下多个体系统的整体行为

研究非时变有向通讯网络背景下一阶线性多个体动力学系统的整体行为.根据通讯网络的结构,系统可以区分为独立基本子系统和非独立基本子系统.当系统的控制规则为一类平凡的线性类型时,系统的独立基本子系统将趋于自身的一致状态,也即子系统中的每个个体趋于子系统的带权中心.独立基本子系统带权中心由子系统的系数矩阵的零特征根归一化左特征向量确定.非独立子系统中个体将趋于独立基本子系统带权中心的凸集内.当且仅当系统的独立基本子系统唯一时,系统实现一致性行为.     

圆柱装药在偏心定向起爆时水中近场压力特性

对UHL-5装药在侧向9点偏心定向起爆和几何中心点起爆时的水下爆炸近场峰值压力分布特性进行实验研究和数值模拟,得到2种起爆条件下不同距离与方位角测点处冲击波峰值压力和侧向9点起爆时的定向增益区域.结果表明,对于5 kg圆柱形UHL-5装药,采用侧向9点偏心定向起爆方式时,在爆距750 mm、方位角90°范围内的流场区域...     

A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm

In this paper, we give a lower bound guaranteeing exact matrix completion via singular value thresholding (SVT) algorithm. The analysis shows that when the parameter in SVT algorithm is beyond some finite scalar, one can recover some unknown low-rank matrices exactly with high probability by solving a strictly convex optimization problem. Furthermore, we give an explicit expression for such a finite scalar. This result in the paper not only has theoretical interests, but also guides us to choose suitable parameters in the SVT algorithm.